Length Synchronization Context-Free Grammars
نویسندگان
چکیده
We propose a new type of regulation on the derivation of a context-free grammar: the productions used for passing from a level of a derivation tree to the next level should have the right-hand members of the same length. We prove that such length synchronized context-free grammars characterize the family of ET0L languages, and therefore are equivalent with the synchronization context-free grammars of H. Jürgensen and K. Salomaa. In this way, a conjecture of H. Jürgensen and K. Salomaa is disproved, about a language which was conjectured not to be generated by a synchronization context-free grammar.
منابع مشابه
Synchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consider the class of languages recognized by automata generated by all its synchronized grammars. The synchronization is an automaton-related notion: all grammars generating the same automaton synchronize the same languages...
متن کاملSynchronization of Grammars
Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata. The languages recognized by grammars synchronized by a given grammar form an effective boolean algebra lying between regular languages and dete...
متن کاملSynchronous Formal Systems Based on Grammars and Transducers
This paper is an extended abstract of a doctoral thesis which studies synchronous formal systems based on grammars and transducers, investigating both theoretical properties and practical application perspectives. It introduces new concepts and definitions building upon the well-known principles of regulated rewriting and synchronization. An alternate approach to synchronization of context-free...
متن کاملOn the Synchronized Derivation Depth of Context-Free Grammars
We consider depth of derivations as a complexity measure for synchronized and ordinary context-free grammars. This measure differs from the earlier considered synchronization depth in that it counts the depth of the entire derivation tree. We consider (non-)existence of trade-offs when using synchronized grammars as opposed to non-synchronized grammars and establish lower bounds for certain cla...
متن کاملEvolving Stochastic Context-Free Grammars from Examples Using a Minimum Description Length Principle
This paper describes an evolutionary approach to the problem of inferring stochastic context-free grammars from nite language samples. The approach employs a genetic algorithm, with a tness function derived from a minimum description length principle. Solutions to the inference problem are evolved by optimizing the parameters of a covering grammar for a given language sample. We provide details...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 2004